void quick_sort(char** names, int* heights, int left, int right) {
	if (left >= right) {
		return;
	}
	int i = left;
	int j = right;
	int pivot = heights[left + (right - left) / 2];
	while (i <= j) {
		while (heights[i] > pivot) {
			i++;
		}
		while (heights[j] < pivot) {
			j--;
		}
		if (i <= j) {
			int tmp = heights[i];
			heights[i] = heights[j];
			heights[j] = tmp;
			char* pstr = NULL;
			pstr = names[i];
			names[i] = names[j];
			names[j] = pstr;
			i++;
			j--;
		}
	}	
	quick_sort(names, heights, left, j);
	quick_sort(names, heights, i, right);
}
char** sortPeople(char** names, int namesSize, int* heights, int heightsSize)
{
	quick_sort(names, heights, 0, heightsSize - 1);

	*returnSize = heightsSize;
	return names;
}